On Computing Optjmized Inout Prohabilities for Random Tes'S

Self testing of inlegraled circ uits by random patterns has several t ~c:hnic:al anti ecnnnmicl'l i l'Itlvantag~s. But ther~ exis.1S a large number of circui ts which cannot be randomly tes ted, since the fault coverage achieved that way would be too low. In this paper we show that this problem can be solved by unequiprobable random p allems, and an efficient procedure is presented compu ting the specific optimal probability for each primary input of a combinational network.